Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
11	Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2010-08-28 23:41:19 Theoretical computer science Mathematical logic Mathematics Logic in computer science Boolean algebra Logic programming Automated planning and scheduling Formal methods Situation calculus Planning Domain Definition Language Boolean satisfiability problem Conjunctive normal form
12	Continued Relevance of Bit-Level Verification Research R. Brayton, N. Een, A. Mishchenko Berkeley Verification and Synthesis Research Center EECS Dept., University of California, Berkeley Introduction Add to Reading List Source URL: fm.csl.sri.com Language: English - Date: 2010-10-30 02:14:08 Theoretical computer science Formal methods Logic in computer science Electronic design automation NP-complete problems Boolean algebra Boolean satisfiability problem Solver Formal equivalence checking Formal verification Model checking Uclid
13	A tetrachotomy for positive first-order logic without equality Florent Madelaine Barnaby Martin Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-04-03 11:35:00 Mathematics Theoretical computer science Abstract algebra FO Finite model theory Sheaf Boolean satisfiability problem Uniform space
14	Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:56:36 Computational complexity theory Theory of computation Theoretical computer science NP-complete problems Complexity classes Logic in computer science Finite model theory Parameterized complexity Resolution Exponential time hypothesis Boolean satisfiability problem Conjunctive normal form
15	Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription Mikol´ aˇs Janota1 , Radu Grigore2, and Joao Marques-Silva3 1 Add to Reading List Source URL: www.mancoosi.org Language: English - Date: 2012-12-16 04:54:55 Logic Mathematics Abstraction Mathematical logic Logical truth Propositional calculus Formal languages Automated theorem proving Substitution Constructible universe Well-formed formula Boolean satisfiability problem
16	¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning II” Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2013-08-19 07:30:22 Logic Logical truth Mathematical logic Theoretical computer science Model theory Automated theorem proving Logic programming Philosophy of logic Satisfiability Substitution Boolean satisfiability problem
17	Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-11-09 10:22:02 Theoretical computer science Computational complexity theory Mathematics Constraint programming NP-complete problems Boolean algebra Parameterized complexity Boolean satisfiability problem Constraint satisfaction problem Exponential time hypothesis Treewidth Tree decomposition
18	On Improving MUS Extraction Algorithms Joao Marques-Silva1,2 and Ines Lynce2 1 2 Add to Reading List Source URL: www.mancoosi.org Language: English - Date: 2012-12-16 04:54:55 Automated theorem proving Logic in computer science Propositional calculus Unsatisfiable core Boolean algebra Resolution Exponential time hypothesis Algorithm Maximum satisfiability problem Boolean satisfiability problem DavisPutnam algorithm
19	Abstraction-Based Algorithm for 2QBF Mikol´asˇ Janota2 and Joao Marques-Silva1,2 1 University College Dublin, Ireland 2 Add to Reading List Source URL: www.mancoosi.org Language: English - Date: 2012-12-16 04:54:55 Logic in computer science Boolean algebra Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem True quantified Boolean formula Maximum satisfiability problem Model checking Conjunctive normal form Satisfiability Tseytin transformation

UPDATE